An Efficient Parallel Algorithm to Solve Block?Toeplitz Systems
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm to Solve Utilization-based Model for Cellular Manufacturing Systems
The design of cellular manufacturing system (CMS) involves many structural and operational issues. One of the important CMS design steps is the formation of part families and machine cells which is called cell formation. In this paper, we propose an efficient algorithm to solve a new mathematical model for cell formation in cellular manufacturing systems based on cell utilization concept. The p...
متن کاملAn Efficient Genetic Algorithm to Solve the Intermodal Terminal Location problem
The exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. In addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the in...
متن کاملAn Efficient Meta Heuristic Algorithm to Solve Economic Load Dispatch Problems
The Economic Load Dispatch (ELD) problems in power generation systems are to reduce the fuel cost by reducing the total cost for the generation of electric power. This paper presents an efficient Modified Firefly Algorithm (MFA), for solving ELD Problem. The main objective of the problems is to minimize the total fuel cost of the generating units having quadratic cost functions subjected to lim...
متن کاملAn Efficient Algorithm to Solve The E - TSP
This paper describes a hybridalgorithm that combines an adaptive-type neural network algorithm and a non-deterministic iterative algorithm to solve the Euclidean Traveling Salesman Problem (E-TSP). It begins with a brief introduction to TSP and E-TSP. Then, it presents the proposed algorithm with its two major components: The convex-elastic net (CEN) algorithm and the non-deterministic iterativ...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2005
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-005-0182-6